Very Short Primality Proofs
نویسندگان
چکیده
It is shown that every prime p has a proof of its primality of length 0(logp) multiplications modulo p.
منابع مشابه
Primality proofs with elliptic curves: heuristics and analysis
This paper deals with the heuristic running time analysis of the elliptic curve primality proving (ECPP) algorithm of Atkin and Morain. Our aim is to collect assumptions and the fastest possible algorithms to reduce the heuristic running time and to show that under these assumptions and some plausible conditions the heuristic running time can be reduced down to o(ln n) bit operation for input p...
متن کاملA polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely used algorithm. We prove the correctness of the Rabin-Miller algorithm in the theory V for polynomial time reasoning, from Fermat’s little theorem. This is interesting because the Rabin-Miller algorithm is a polytime ra...
متن کاملCyclotomy Primality Proofs and Their Certificates
The first efficient general primality proving method was proposed in the year 1980 by Adleman, Pomerance and Rumely and it used Jacobi sums. The method was further developed by H. W. Lenstra Jr. and more of his students and the resulting primality proving algorithms are often referred to under the generic name of Cyclotomy Primality Proving (CPP). In the present paper we give an overview of the...
متن کاملAlgebraic and Combinatorial Methods in Computational Complexity 1 Executive Summary 64 12421 – Algebraic and Combinatorial Methods in Computational Complexity
At its core, much of Computational Complexity is concerned with combinatorial objects and structures. But it has often proven true that the best way to prove things about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic pr...
متن کاملFormal and Efficient Primality Proofs by Use of Computer Algebra Oracles
The problem of showing whether a positive number is prime or composite is historically recognized to be an important and useful problem in arithmetic. Since Euclid’s times, the interest in prime numbers has only been growing. For today’s applications, primality testing is central to public key cryptography and for this reason is still heavily investigated in number theory (Ribenboim, 1996). Alt...
متن کامل